Mediekompetanse i det sosiokulturelle felt

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Com~jderations on Modcls of I\1ovcment Det~ction

A general charaelerization of multi-input 1'1Ovcmcnt (!clt'ctioH . models is given in terms of tl.e Volterra series formalism. Wheil nonlinearities of order higher than the second arc ncgligibk, an II-input system can be decomposed into a sd of 2-input systems, summing lillearly. For a isymmdrical) 2-inpllt system which h;!s sigllifjcanlnonline:iri~ics only lip 10the second order, (he correlati...

متن کامل

On the Convexity of log det (I + K X^{-1})

A simple proof is given for the convexity of log det(I +KX) in the positive definite matrix variable X ≻ 0 with a given positive semidefinite K 0. Convexity of functions of covariance matrices often plays an important role in the analysis of Gaussian channels. For example, suppose Y and Z are independent complex Gaussian nvectors with Y ∼ N(0,K) and Z ∼ N(0,X). Then, I(Y;Y + Z) = log det(I +KX)...

متن کامل

Felt Emotions

What does it mean “feeling” something? How body activation and its perception is crucial in emotional experience? How it impact on the cognitive components of human emotions and their “appraisal” function, or is affected by them? Which are the different mental paths of emotional experiences?

متن کامل

The Norwegian type-anaphor det

This paper gives a description of the Norwegian type anaphor det ('that') and proposes a formal representation of it in the HPSG framework. This identity-of-sense anaphor is interpreted as referring to a (new) set of entities of the same type as its antecedent. Its antecedent has to be either indefinite or a definite NP that is likely to introduce a brand new discourse referent. Whereas the typ...

متن کامل

Det-extremal cubic bipartite graphs

Let G be a connected k–regular bipartite graph with bipartition V (G) = X ∪Y and adjacency matrix A. We say G is det–extremal if per(A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det–extremal 3–connected cubic bipartite graphs. We extend McCuaig’s result by determining the structure of det–extremal cubic bipartite graphs of conne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Norsk medietidsskrift

سال: 2004

ISSN: 0805-9535,0804-8452

DOI: 10.18261/issn0805-9535-2004-03-02